Spectra of winner-take-all stochastic neural networks
نویسنده
چکیده
In Piekniewski & Schreiber (2008) we have developed a simple mathematical model for information flow structure in a class of recurrent neural networks and shown that its asymptotic behaviour is scale-free and admits a description in terms of the so-called winner-take-all dynamics. In the present paper we establish a limit theorem for spectra of the spike-flow graphs induced by the winner-take-all dynamics.
منابع مشابه
Spectra of the Spike Flow Graphs of Recurrent Neural Networks
Abstract. Recently the notion of power law networks in the context of neural networks has gathered considerable attention. Some empirical results show that functional correlation networks in human subjects solving certain tasks form power law graphs with exponent approaching ≈ 2. The mechanisms leading to such a connectivity are still obscure, nevertheless there are sizable efforts to provide t...
متن کاملA learning framework for winner-take-all networks with stochastic synapses
Many recent generative models make use of neural networks to transform the probability distribution of a simple low-dimensional noise process into the complex distribution of the data. This raises the question of whether biological networks operate along similar principles to implement a probabilistic model of the environment through transformations of intrinsic noise processes. The intrinsic n...
متن کاملA Fast Winner-Take-All Neural Networks With the Dynamic Ratio
In this paper, we propose a fast winner-take-all (WTA) neural network. The fast winner-take-all neural network with the dynamic ratio in mutual-inhibition is developed from the general mean-based neural network (GEMNET), which adopts the mean of the active neurons as the threshold of mutual inhibition. Furthermore, the other winner-take-all neural network enhances the convergence speed to becom...
متن کاملWinner-Take-All Discrete Recurrent Neural Networks
This paper proposes a discrete recurrent neural network model to implement winner-take-all function. This network model has simple organizations and clear dynamic behaviours. The dynamic properties of the proposed winner-take-all networks are studied in detail. Simulation results are given to show network performance. Since the network model is formulated as discrete time systems , it has advan...
متن کاملOn the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve competitive stages have so far been neglected in computational complexity theory, although they are widely used in computational brain models, artificial neural networks, and analog VLSI. Our theoretical analysis shows...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008